Algebraic genericity of frequently universal harmonic functions on trees
نویسندگان
چکیده
منابع مشابه
On Harmonic Functions on Trees
By a tree T we mean a connected graph such that every subgraph obtained from T by removing any of its edges is not connected. In what follows we will only consider trees in which we distinguish a vertex v0 as an origin. As usual we denote by V and E the set of vertices and the set of edges (respectively) of the tree. If v and w are the boundary vertices of an edge, we say that they are neighbou...
متن کاملstudy of hash functions based on chaotic maps
توابع درهم نقش بسیار مهم در سیستم های رمزنگاری و پروتکل های امنیتی دارند. در سیستم های رمزنگاری برای دستیابی به احراز درستی و اصالت داده دو روش مورد استفاده قرار می گیرند که عبارتند از توابع رمزنگاری کلیددار و توابع درهم ساز. توابع درهم ساز، توابعی هستند که هر متن با طول دلخواه را به دنباله ای با طول ثابت تبدیل می کنند. از جمله پرکاربردترین و معروف ترین توابع درهم می توان توابع درهم ساز md4, md...
Labeled Trees, Functions, and an Algebraic Identity
We give a short and direct proof of a remarkable identity that arises in the enumeration of labeled trees with respect to their indegree sequence, where all edges are oriented from the vertex with lower label towards the vertex with higher label. This solves a problem posed by Shin and Zeng in a recent article. We also provide a generalization of this identity that translates to a formula for t...
متن کاملSimulating Algebraic Specification Genericity on Languages with Initial Semantics
This paper discusses the concept of genericity often used in algebraic specification languages and how this concept can be simulated in a meta level in languages with purely initial semantics, as it is the case for ELAN and ASF+SDF. This proposal is being integrated into the FERUS tool, in development for ELAN, and will have the effect of providing in the meta level better modularity features w...
متن کاملUniversal maps on trees
A map f : R ! S of continua R and S is called a universal map from R to S if for any map g : R ! S, f(x) = g(x) for some point x 2 R. When R and S are trees, we characterize universal maps by reducing to the case of light minimal universal maps. The characterization uses the notions of combinatorial map and folded subedge of R. MOS Subject Classi cation Primary: 54H25 Secondary: 54F20
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 2020
ISSN: 0022-247X
DOI: 10.1016/j.jmaa.2020.124132